An Approach to Solve the Set Covering Problem with the Soccer League Competition Algorithm
نویسندگان
چکیده
The Soccer League Competition algorithm (SLC) is a new nature-based metaheuristic approach to solve optimization problems. It gets its basis model from the interaction between soccer teams and their players in a soccer league competition, where each player (feasible solution) compete for victory and be the best player. This paper presents a review of the underlaying SLC model and a practical approach to solve the Set Covering Problem using SLC and Python as programming language and tested over a widely OR-Library SCP benchmarks to obtain convergence capability and effectiveness of the implementation.
منابع مشابه
Testing Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures
Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...
متن کاملA novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem
Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...
متن کاملAn Efficient Genetic Algorithm to Solve the Intermodal Terminal Location problem
The exponential growth of the flow of goods and passengers, fragility of certain products and the need for the optimization of transport costs impose on carriers to use more and more multimodal transport. In addition, the need for intermodal transport policy has been strongly driven by environmental concerns and to benefit from the combination of different modes of transport to cope with the in...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کامل